Nuprl Lemma : fun-path_wf 11,40

T:Type, f:(TT), xy:TL:(T List). x=f*(y) via L   
latex


Definitionss = t, t  T, False, Type, x:AB(x), type List, a < b, , P  Q, A, i  j , ||as||, b, hd(l), True, x:AB(x), <ab>, #$n, , last(L), n+m, l[i], f(a), x:A  B(x), P & Q, n - m, {i..j}, Void, A c B, y=f*(x) via L
Lemmasmember wf, select wf, int seg wf, last wf, assert wf, true wf, not wf, false wf

origin